Network and Graph Theory - Critical path.
Test Yourself 1.
Given a diagram. | 1. Answer.9 edges. |
2. Answer.14 edges. | |
3. Answer.11 vertices. | |
Determining float time. | 4. |
6. | |
2019 HSC Sample | |
10. Answer.Vertex D has degree 4. | |
Determining the Critical path | 11.
The sequence required to implement a building project is summarised in the diagram above. The activities to be completed are named along each edge together with the time required to complete that activity. The earliest start and latest finish times are summarised in the nodes. With reference to the information provided in the diagram: Answer.(i) 16 weeks. (ii) Week 3. (iii) The CP is A-C-F-G-J-L. (iv) 5 weeks. (v) No imact because the float time for Activity D is 6 weeks which is less than the delay in starting. In addition, Activity D is not on the critical path. |
12. | |
Determining slack, etc | |